翻訳と辞書 Words near each other ・ Unoosha ・ Unopened ・ Unoprostone ・ Unorchestrated ・ Unordered associative containers (C++) ・ Unordered map ・ Unordered pair ・ Unorganisation ・ Unorganised sector (India) ・ Unorganised Workers' Social Security Act 2008 ・ Unorganized area (Canada) ・ Unorganized Borough, Alaska ・ Unorganized Centre Parry Sound District ・ Unorganized East Timiskaming District ・ Unorganized Kenora District ・ Unorganized machine ・ Unorganized Mainland Manitoulin District ・ Unorganized North Algoma District ・ Unorganized North Cochrane District ・ Unorganized North East Parry Sound District ・ Unorganized North Nipissing District ・ Unorganized North Sudbury District ・ Unorganized Rainy River District ・ Unorganized South East Algoma District ・ Unorganized South East Cochrane District ・ Unorganized South Nipissing District ・ Unorganized South West Cochrane District ・ Unorganized territory ・ Unorganized Thunder Bay District ・ Unorganized West Manitoulin District Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Unorganized machine ： ウィキペディア英語版 Unorganized machine An unorganized machine is a concept mentioned in a far-sighted 1948 report in which Alan Turing suggested that the infant human cortex was what he called an "unorganised machine".〔Turing's 1948 paper has been re-printed as Turing AM. Intelligent Machinery. In: Ince DC, editor. ''Collected works of AM Turing — Mechanical Intelligence.'' Elsevier Science Publishers, 1992.〕〔Webster CS. Alan Turing's unorganized machines and artificial neural networks: his remarkable early work and future possibilities. ''Evolutionary Intelligence'' 2012: 5; 35-43.〕 Turing defined the class of unorganized machines as largely random in their initial construction, but capable of being trained to perform particular tasks. Turing's unorganized machines were in fact very early examples of randomly connected, binary neural networks, and Turing claimed that these were the simplest possible model of the nervous system. Turing had been interested in the possibility of simulating neural systems for at least the previous two years. In correspondence with William Ross Ashby in 1946 he writes: In his 1948 paper Turing defined two examples of his unorganized machines. The first were ''A-type machines'' — these being essentially randomly connected networks of NAND logic gates. The second were called ''B-type machines'', which could be created by taking an A-type machine and replacing every inter-node connection with a structure called a ''connection modifier'' — which itself is made from A-type nodes. The purpose of the connection modifiers were to allow the B-type machine to undergo "appropriate interference, mimicking education" in order to organize the behaviour of the network to perform useful work. Before the term ''genetic algorithm'' was coined, Turing even proposed the use of what he called a ''genetical search'' to configure his unorganized machines.〔(Compucology.net Technology and biology "Unorganized machines and the brain" )〕 Turing claimed that the behaviour of B-type machines could be very complex when the number of nodes in the network was large, and stated that the "picture of the cortex as an unorganized machine is very satisfactory from the point of view of evolution and genetics". ==Notes== 〔 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Unorganized machine」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.